COMBINATORIAL OPERATORS FOR KRONECKER POWERS OF REPRESENTATIONS OF Sn
نویسندگان
چکیده
We present combinatorial operators for the expansion of the Kronecker product of irreducible representations of the symmetric group Sn. These combinatorial operators are defined in the ring of symmetric functions and act on the Schur functions basis. This leads to a combinatorial description of the Kronecker powers of the irreducible representations indexed with the partition (n− 1, 1) which specializes the concept of oscillating tableaux in Young’s lattice previously defined by S. Sundaram. We call our specialization Kronecker tableaux. Their combinatorial analysis leads to enumerative results for the multiplicity of irreducible representations in the Kronecker powers of the forms χ(n−1,1) ⊗k and P⊗k where P is the permutation representation of Sn.
منابع مشابه
. R T ] 1 5 M ar 2 00 5 COMBINATORIAL OPERATORS FOR KRONECKER POWERS OF REPRESENTATIONS OF
We present combinatorial operators for the expansion of the Kronecker product of irreducible representations of the symmetric group Sn. These combinatorial operators are defined in the ring of symmetric functions and act on the Schur functions basis. This leads to a combinatorial description of the Kronecker powers of the irreducible representations indexed with the partition (n − 1, 1) which s...
متن کاملA Combinatorial Interpretation for the Coefficients in the Kronecker Product s(n−p,p) ∗ sλ
In this paper we give a combinatorial interpretation for the coefficient of sν in the Kronecker product s(n−p,p) ∗ sλ, where λ = (λ1, . . . , λ`(λ)) ` n, if `(λ) ≥ 2p − 1 or λ1 ≥ 2p − 1; that is, if λ is not a partition inside the 2(p − 1) × 2(p − 1) square. For λ inside the square our combinatorial interpretation provides an upper bound for the coefficients. In general, we are able to combinat...
متن کاملMultiplicities in the Kronecker Product s (n−p,p) ∗ sλ
In this paper we give a combinatorial interpretation for the coefficient of sν in the Kronecker product s(n−p,p) ∗ sλ, where λ = (λ1, . . . , λl(λ)) ⊢ n, if l(λ) ≥ 2p − 1 or λ1 ≥ 2p − 1; that is, if λ is not a partition inside the 2(p − 1) × 2(p − 1) square. For λ inside the square our combinatorial interpretation provides an upper bound for the coefficients. In general, we are able to combinat...
متن کاملKronecker Products, Characters, Partitions, and the Tensor Square Conjectures
We study the remarkable Saxl conjecture which states that tensor squares of certain irreducible representations of the symmetric groups Sn contain all irreducibles as their constituents. Our main result is that they contain representations corresponding to hooks and two row Young diagrams. For that, we develop a new sufficient condition for the positivity of Kronecker coefficients in terms of c...
متن کاملThe Kronecker Power of a Permutation*
Let Sn denote the full symmetric permutation group of degree n. For each a E e, let (J (a) be the corresponding permutation matrix, i.e., Q(a) = (0 iUU»)' If e is any subgroup of S n, then Q is a faithful representation of e whose c haracter, e, counts the number of fixed points . In trus note, we in vestigate a red uction of fr, the character of the rth Kronecker power of (J . The reduction of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006